A note on periodic schedules for linear precedence constraints

Periodic schedules for linear precedence constraints

We consider the computation of periodic cyclic schedules for linear precedence constraints graph: a linear precedence constraint is defined between two tasks and induces an infinite set of usual precedence constraints between their executions such the the difference of iterations is a linear function.The objective function is the minimization of the maximal period of a task. Firstly, we recall ...

A Relational Interpretation of Linear Precedence Constraints

Handling Linear Precedence Constraints by Unification

Linear precedence (LP) rules are widely used for stating word order principles. They have been adopted as constraints by HPSG but no encoding in the formalism has been provided. Since they only order siblings, they are not quite adequate, at least not for German. We propose a notion of LP constraints that applies to linguistically motivated branching domains such as head domains. We show a type...

Online Linear Optimization for Job Scheduling Under Precedence Constraints

We consider an online job scheduling problem on a single machine with precedence constraints under uncertainty. In this problem, for each trial t = 1, . . . , T , the player chooses a total order (permutation) of n fixed jobs satisfying some prefixed precedence constraints. Then, the adversary determines the processing time for each job, 9 and the player incurs as loss the sum of the processing...

A local approach to automated correction of violated precedence and resource constraints in manually altered schedules

Users of automated scheduling systems frequently require an interactive approach to scheduling where they can manually modify the schedules. Because of complexity and cohesion of scheduling relations, it may happen that manual modification introduces flaws to the schedule, namely the altered schedule violates some constraints such as precedence relations or limited capacity of resources. It is ...